Quantum algorithms for shifted subset problems
نویسنده
چکیده
We consider a recently proposed generalisation of the abelian hidden subgroup problem: the shifted subset problem. The problem is to determine a subset S of some abelian group, given access to quantum states of the form |S + x〉, for some unknown shift x. We give quantum algorithms to find Hamming spheres and other subsets of the boolean cube {0, 1}n. The algorithms have time complexity polynomial in n and give rise to exponential separations from classical computation.
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملEfficient Quantum Algorithms for Shifted Quadratic Character Problems
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear to fit into the framework of the Hidden Subgroup Problem. The classical complexity of the problem is unknown, despite the various results on the irregularity ...
متن کاملNew Solutions for Singular Lane-Emden Equations Arising in Astrophysics Based on Shifted Ultraspherical Operational Matrices of Derivatives
In this paper, the ultraspherical operational matrices of derivatives are constructed. Based on these operational matrices, two numerical algorithms are presented and analyzed for obtaining new approximate spectral solutions of a class of linear and nonlinear Lane-Emden type singular initial value problems. The basic idea behind the suggested algorithms is basically built on transforming the eq...
متن کاملEnhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems
Difficult knapsack problems are problems that are expressly designed to be difficult. In this paper, enhanced Quantum Evolutionary Algorithms are designed and their application is presented for the solution of the DKPs. The algorithms are general enough and can be used with advantage in other subset selection problems.
متن کاملA Quantum Approach to Subset-Sum and Similar Problems
In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games [1]. Under described certain assumptions, we show that the exact solution of the subset sum problem my be obtained in polynomial time and the exponential speed-up over the classical algorithms may be possible. We give a numerical example and dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 9 شماره
صفحات -
تاریخ انتشار 2009